Terminating Grid Exploration with Myopic Luminous Robots

نویسندگان

چکیده

We investigate the terminating grid exploration for autonomous myopic luminous robots. Myopic robots mean that they can observe nodes only within a certain fixed distance, and have light devices emit colors. First, we prove that, in semi-synchronous asynchronous models, three are necessary to achieve if visible distance is one. Next, give fourteen algorithms various assumptions of synchrony (fully-synchronous, semi-synchronous, models), number colors, chirality. Six them optimal terms

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ring Exploration with Oblivious Myopic Robots

Many potential applications exist for multi-robot systems in various contexts related to safety and security. Terminating exploration is a basic building block for many of these applications. It requires that starting from a configuration where no two robots occupy the same location, every location needs to be visited by at least one robot, with the additional constraint that all robots eventua...

متن کامل

Optimal Grid Exploration by Asynchronous Oblivious Robots

We propose optimal (w.r.t. the number of robots) solutions for the deterministic terminating exploration (exploration for short) of a grid-shaped network by a team of k asynchronous oblivious robots in the asynchronous non-atomic model, so-called CORDA. In more details, we first consider the ATOM model. We show that it is impossible to explore a grid of at least three nodes with less than three...

متن کامل

Computations by Luminous Robots

The study of computability issues by a system of simple, autonomous, oblivious, mobile robots, operating in the plane in LookCompute-Move cycles, has been the object of intensive investigations. These robots do not have explicit communication mechanisms, but they implicitly cooperate towards a common goal. This paper focuses on luminous robots, a recently introduced model where the robots are e...

متن کامل

Improved Protocols for Luminous Asynchronous Robots

The distributed setting of computational mobile entities, called robots, that have to perform tasks without global coordination has been extensively studied in the literature. A well-known scenario is that in which robots operate in Look-Compute-Move (LCM) cycles. LCM cycles might be subject to different temporal constraints dictated by the considered schedule. The classic models for the activa...

متن کامل

Mutual Visibility by Luminous Robots Without Collisions

Consider a finite set of identical computational entities that can move freely in the Euclidean plane operating in Look-Compute-Move cycles. Let p(t) denote the location of entity p at time t; entity p can see entity q at time t if at that time no other entity lies on the line segment p(t)q(t). We consider the basic problem called Mutual Visibility: starting from arbitrary distinct locations, w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International journal of networking and computing

سال: 2022

ISSN: ['2185-2839', '2185-2847']

DOI: https://doi.org/10.15803/ijnc.12.1_73